A Study of the Major Graph Labelings of Trees

نویسنده

  • Auparajita Krishnaa
چکیده

Tree is one of the most studied and practically useful classes of graphs and is the attention of a great number of studies. There is absence of generalized results for tree as a class and even for one kind of labeling as whole. Only specialized results exist limited to specific types of trees only. A number of conjectures stand being unsolved. Graham and Sloane (1980) conjectured trees to be Harmonious and Ringel-Kotzig conjectured trees to be Graceful about three decades ago. Kotzig and Rosa (1970) ask the question whether all trees are Magic or not. No generalized result for Antimagic labeling is given for trees so far. This paper presents the methodologies to obtain the major labeling schemes for trees viz., Harmonious, Sequential, Felicitous, Graceful, Antimagic and found the trees to be not Magic except T (2, 1), thus solving the said conjectures. These findings could also be useful for those working in fields where graphs serve as models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

Roman domination excellent graphs: trees

A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...

متن کامل

Snakes and Caterpillars in Graceful Graphs

Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...

متن کامل

Three Graceful Operations

A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G a...

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2004